Search results for "Blocking set"

showing 8 items of 8 documents

An optimal bound for embedding linear spaces into projective planes

1988

Abstract Linear spaces with υ >n 2 − 1 2 n + 1 points, b⩽n2 + n + 1 lines and not constant point degree are classified. It turns out that there is essentially one class of such linear spaces which are not near pencils and which can not be embedded into any projective plane of order n.

CombinatoricsBlocking setDuality (projective geometry)Discrete Mathematics and CombinatoricsProjective spaceEmbeddingProjective planeFano planeTheoretical Computer ScienceMathematicsDiscrete Mathematics
researchProduct

Partial spreads in finite projective spaces and partial designs

1975

A partial t-spread of a projective space P is a collection 5 p of t-dimensional subspaces of P of the same order with the property that any point of P is contained in at most one element of 50. A partial t-spread 5 p of P is said to be a t-spread if each point of P is contained in an element of 5P; a partial t-spread which is not a spread will be called strictly partial. Partial t-spreads are frequently used for constructions of affine planes, nets, and Sperner spaces (see for instance Bruck and Bose [5], Barlotti and Cofman [2]). The extension of nets to affine planes is related to the following problem: When can a partial t-spread 5 ~ of a projective space P be embedded into a larger part…

CombinatoricsCollineationBlocking setGeneral MathematicsComplex projective spaceProjective spaceProjective planeProjective linear groupQuaternionic projective spaceTwisted cubicMathematicsMathematische Zeitschrift
researchProduct

Zur Hyperebenenalgebraisierung in desargues-Schen projektiven Verbandsgeometrien

1991

As a completion and extension of a result of A. Day and D. Pickering [5] we obtain the following structure theorem in the conceptual frame of projective lattice geometries: In a Desarguesian projective geometry the subgeometry of every at least one-dimensional hyperplane is module induced.

CombinatoricsDiscrete mathematicsProjective harmonic conjugateCollineationBlocking setDuality (projective geometry)Projective spaceGeometry and TopologyProjective planeNon-Desarguesian planeProjective geometryMathematicsJournal of Geometry
researchProduct

Graphs of stable maps from closed surfaces to the projective plane

2018

Abstract We describe how to attach a weighted graph to each stable map from closed surfaces to projective plane and prove that any weighted graph with non negatively weighted vertices is the graph of some stable map from a closed surface to the projective plane.

Discrete mathematicsPlane curve010102 general mathematicsLine at infinity01 natural sciencesPlanar graph010101 applied mathematicsCombinatoricssymbols.namesakeBlocking setReal projective planesymbolsProjective spaceGeometry and TopologyProjective plane0101 mathematicsPencil (mathematics)MathematicsTopology and its Applications
researchProduct

A note on projective coordinate systems of modular lattices

1993

This note clarifies the combinatorial nature of projective coordinate systems of modular upper continuous lattices. It generalizes the classical relationship between 3-dimensional Desarguesian configurations and coordinate systems of projective 3-spaces.

Discrete mathematicsPure mathematicsClassical modular curveBlocking setDuality (projective geometry)Projective spaceGeometry and TopologyEllipsoidal coordinatesCoordinate spacePencil (mathematics)Twisted cubicMathematicsJournal of Geometry
researchProduct

On n–Fold Blocking Sets

1986

An n-fold blocking set is a set of n-disjoint blocking sets. We shall prove upper and lower bounds for the number of components in an n-fold blocking set in projective and affine spaces.

Discrete mathematicsSet (abstract data type)CombinatoricsQuantitative Biology::BiomoleculesSteiner systemBlocking setFold (higher-order function)Blocking (radio)Projective planeAffine transformationUpper and lower boundsMathematics
researchProduct

A Common Characterization of Finite Projective Spaces and Affine Planes

1981

Let S be a finite linear space for which there is a non-negative integer s such that for any two disjoint lines L, L' of S and any point p outside L and L' there are exactly s lines through p intersecting the two lines L and L'. We prove that one of the following possibilities occurs: (i) S is a generalized projective space, and if the dimension of S is at least 4, then any line of S has exactly two points. (ii) S is an affine plane, an affine plane with one improper point, or a punctured projective plane. (iii) S is the Fano-quasi -plane.

Plane curveFano planeTheoretical Computer ScienceCombinatoricsReal projective lineComputational Theory and MathematicsBlocking setReal projective planeFinite geometryDiscrete Mathematics and CombinatoricsProjective spaceGeometry and TopologyProjective planeMathematicsEuropean Journal of Combinatorics
researchProduct

A characterization of the line set of an odd-dimensional Baer subspace

1990

Generalizing a theorem of Beutelspacher and Seeger, we consider line sets\(\mathcal{L}\) inP=PG(2t + 1,q),t ∈ IN, with the following properties: (1) any (t + 1)-dimensional subspace ofP contains at least one line of\(\mathcal{L}\), (2) if a pointx ofP is incident with at least two lines of\(\mathcal{L}\) then the points in the factor geometryP/x which are induced by the lines of\(\mathcal{L}\) throughx form a blocking set of type (t, 1) inP/x, (3) any line of\(\mathcal{L}\) is coplanar with at least one further line of\(\mathcal{L}\). We will show that the examples of minimal cardinality are exactly the line sets of Baer subspaces ofP.

Set (abstract data type)CombinatoricsDiscrete mathematicsCardinalityBlocking setLine (geometry)Geometry and TopologyCharacterization (mathematics)Type (model theory)Linear subspaceSubspace topologyMathematicsJournal of Geometry
researchProduct